Deflating polygons to the limit

نویسندگان

  • Perouz Taslakian
  • Isabel Hubard
چکیده

In this paper we study polygonal transformations through an operation called deflation. It is known that some families of polygons deflate infinitely for given deflation sequences. Here we show that every infinite deflation sequence of a polygon P has a unique limit, and that this limit is flat if and only if exactly two vertices of P move (are reflected) finitely many times in the sequence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability of Brocard Points of Polygons

A continuous nested sequence of similar triangles converging to the Brocard point of a given triangle is investigated. All these triangles have the same Brocard point. For polygons, the Brocard point need not exist, but there is always a limit object for an analogously defined nested sequence of inner polygons. This limit object is a Brocard point if and only if the inner polygons are all simil...

متن کامل

Staircase polygons: moments of diagonal lengths and column heights

We consider staircase polygons, counted by perimeter and sums of k-th powers of their diagonal lengths, k being a positive integer. We derive limit distributions for these parameters in the limit of large perimeter and compare the results to Monte-Carlo simulations of self-avoiding polygons. We also analyse staircase polygons, counted by width and sums of powers of their column heights, and we ...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

The Rocky Mountain Journal of Mathematics 30(2000), 411-434 STABILITY OF BROCARD POINTS OF POLYGONS

A continuous nested sequence of similar triangles converging to the Brocard point of a given triangle is investigated. All these triangles have the same Brocard point. For polygons, the Brocard point need not exist, but there is always a limit object for an analogously defined nested sequence of inner polygons. This limit object is a Brocard point if and only if the inner polygons are all simil...

متن کامل

Newton polygons for character sums and Poincaré series

In this paper, we precise the asymptotic behaviour of Newton polygons of L-functions associated to character sums, coming from certain n variable Laurent polynomials. In order to do this, we use the free sum on convex polytopes. This operation allows the determination of the limit of generic Newton polygons for the sum ∆ = ∆1 ⊕ ∆2 when we know the limit of generic Newton polygons for each facto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010